Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

限定广义纳什均衡及其控制罚算法

广义纳什均衡问题通常有很多解,只有在相当严格的条件下,才有可能得到唯一解。如果任意选取其中之一作为该问题的解,显然是不合理的。为此,提出限定广义纳什均衡的概念。通过给共同约束相对应的拉格朗日乘子增加约束的方法,找出具有某些特性的解。为了求解限定广义纳什均衡,还进一步给出了控制罚算法。     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017     

基于Matlab四杆式液压起落机构运动学与动力学分析

提出了一种可用于加油卷盘升降的四杆式液压起落机构的设计方案。分析了四杆式液压起落机构的工作原理,采用复数向量法建立了运动学和动力学数学模型。利用Matlab软件编制了相应的程序进行实例分析和计算,得到了机构关键点的仿真轨迹和有关构件的角位移、角速度及角加速度曲线。运用理论分析计算和软件仿真,验证了机构设计的合理性和方案的可行性。     

广州市邮件业务量对确定运能需求的研究

为了合理利用车辆资源,为决策提供理论依据,本文采用多元统计回归分析法与模糊数学优化法,为广州市邮政局车辆运能研究,建立了数学模型,并附有项目软件,计算结果与实际情况吻合较好。这样,对合理利用邮政车辆资源,提高运营效率,具有一定的意义。     

基于合成沸石的Cr~(3+)深度吸附处理

以吸附后溶液中Cr3+质量浓度低于国家相关标准为目的,采用搅拌动态吸附的方法,研究投加量、吸附时间、吸附温度、pH值对吸附的影响,考察沸石粉对Cr3+深度吸附的条件。实验发现,在沸石粉投加量为1g/L的前提下,吸附时间为2h、温度为55℃、pH值为4~5时分别达到较好吸附效果。开展三因素三水平正交试验,得到深度吸附条件为:投加量1g/L、吸附时间2h、吸附温度35℃、pH=5,此时去除率达到99.7%。对深度吸附条件进行验证,发现在此条件下可以将Cr3+溶液的质量浓度由0.1mg/L降低至0.03mg/L;最后通过实验得出沸石粉对Cr3+的饱和吸附量为79.93mg/g。     

潜艇自航模系统可靠性优化设计

针对潜艇自航模系统可靠性设计问题,提出了有针对性的可靠性优化设计方法;在构建矩阵式任务剖面的基础上,应用多阶段任务系统可靠性建模理论建立系统可靠性模型并开展预计;根据FMEA分析结果提出技术改进措施,以体积、重量、成本为约束构建可靠性冗余优化模型并利用微粒群算法求解.案例证明了该优化设计的有效性及可行性.     

基于粗糙集的装备保障要素关系研究

根据装备保障的特点和装备保障工作中面临的实际问题,结合装备保障影响因素分析,构建了基于粗糙集的装备保障关系研究模型,解决了传统分析方法不能描述不一致保障现象的问题,为装备保障研究工作提供了一种新的思路.     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

C++Builder 控件技术在自助售票机中的应用

用C++Builder强有力的控件技术及多线程技术,实现一个32位串口控件,并将其应用于串行设备软件接口,走出传统的由动态链接库提供低层接口软件的方式,从而大大减轻上层应用软件的开发负担